Integration of Morphological and Syntactic Analysis based on LR Parsing Algorithm
نویسندگان
چکیده
منابع مشابه
Integration of morphological and syntactic analysis based on LR parsing algorithm
Morphological analysis of Japanese is very different from that of English, because no spaces are placed between words. The analysis includes segmentation of words. However, ambiguities in segmentation is not always resolved only with morphological information. This paper proposes a method to integrate the morphological and syntactic analysis based on LR parsing algorithm. An LR table derived fr...
متن کاملAn Extended LR Parsing Algorithm For Grammars Using Feature-Based Syntactic Categories
This paper proposes an LR parsing algorithm modified for grammars with feature-based categories. The proposed algorithm does not instantiate categories during preprocessing of a grammar as proposed elsewhere. As a result, it constructs a minimal size of GOTO/ACTION table and eliminates the necessity of search for GOTO table entries during parsing. 1 I n t r o d u c t i o n The LR method is know...
متن کاملNews Abridgement Algorithm Based on Word Alignment and Syntactic Parsing
The rapid development of new media results in a lot of redundant information, increasing the difficulty of quickly obtaining useful information and browsing simplified messages on portable devices. Thus emerges the automatic news abridgement technology. We propose a novel method of word alignment, aiming at news headlines, applying the combination method of statistics and rules to intelligent a...
متن کاملComponent-based LR parsing
b The University of Alabama at Birmingham Department of Computer and Information Sciences 115A Campbell Hall, 1300 University Boulevard, Birmingham, Alabama 35294-1170, United States { bryant, gray}@cis.uab.edu Phone: +1 205-934-2213 Fax: +1 205-934-5473 c University of Maribor Faculty of Electrical Engineering and Computer Science Smetanova ulica 17, 2000 Maribor, Slovenia marjan.mernik@uni-mb...
متن کاملGeneralized Lr Parsing Algorithm for Boolean Grammars
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical connectives added to the formalism of rules. In addition to the standard LR operations, Shift and Reduce, the new algorithm uses a third operation called Invalidate, which reverses a previously made reduction. This oper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Natural Language Processing
سال: 1995
ISSN: 1340-7619,2185-8314
DOI: 10.5715/jnlp.2.2_59